A Rough Sets based modified Scatter Search algorithm for solving 0-1 Knapsack problem
نویسنده
چکیده
Article history: Received December 10, 2014 Received in revised format: January 4, 2015 Accepted February 20, 2015 Available online February 24 2015 This paper presents a new search methodology for different sizes of 0-1 Knapsack Problem (KP). The proposed methodology uses a modified scatter search as a meta-heuristic algorithm. Moreover, rough set theory is implemented to improve the initial features of scatter search. Thereby, the preliminary results of applying the proposed approach on some benchmark dataset appear that the proposed method was capable of providing better results in terms of time and quality of solutions. Growing Science Ltd. All rights reserved. 5 © 201
منابع مشابه
An Exact Cooperative Method for Solving the 0-1 Multidimensional Knapsack Problem
This article presents an exact cooperative method for solving the Multidimensional Knapsack Problem (MKP ) which combines dynamic programming and branch and bound. The first step of our algorithm tries to find out a good feasible solution of the (MKP ) using surrogate relaxation. For this purpose, we have developed a modified dynamic programming algorithm. The second step is based on a branch a...
متن کاملA Hybrid Genetic Scatter Search Algorithm for Solving Optimization Problems
The search methods that have been developed to investigate the optimum point of any optimization problem are suffering from some shortcomings especially that are complex and NP-hard problems. The progress that have been achieved in the filed of information technology leads to developing a new search methods called "intelligent search methods". This paper highlights hybrid genetic scatter search...
متن کاملFuzzy-rough Information Gain Ratio Approach to Filter-wrapper Feature Selection
Feature selection for various applications has been carried out for many years in many different research areas. However, there is a trade-off between finding feature subsets with minimum length and increasing the classification accuracy. In this paper, a filter-wrapper feature selection approach based on fuzzy-rough gain ratio is proposed to tackle this problem. As a search strategy, a modifie...
متن کاملGenetic Algorithm with Directional Mutation Based on Greedy Strategy for Large-scale 0-1 Knapsack Problems
In view of the lack of efficiency or accuracy of solving large-scale 0-1 knapsack problems by the classic genetic algorithm, a directional mutation operator is designed to reduce the probability of resampling in the search process. Meanwhile an initializing operator and an individual correction operator are added to the algorithm to modify individual after every amendment, both of which are com...
متن کاملA Scatter Search Method for the Bi-Criteria Multi-dimensional {0, 1}-Knapsack Problem using Surrogate Relaxation
This paper presents a scatter search (SS) based method for the bi-criteria multi-dimensional knapsack problem. The method is organized according to the usual structure of SS: 1) diversi...cation 2) improvement 3) reference set update 4) subset generation, and 5) solution combination. Surrogate relaxation is used to convert the multi-constraint problem into a single constraint one, which is used...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015